LeetCode - 1. Two Sum

문제 링크

problem

Java 풀이

class Solution {
    public int[] twoSum(int[] nums, int target) {    
        int[] answer = new int[2];
        for(int i = 0; i < nums.length; i++){
            for(int j = i+1; j < nums.length; j++){
                if(nums[i] + nums[j] == target){
                    answer[0] = i;
                    answer[1] = j;
                }
            }
        }
        return answer;
    }
}

Javascript 풀이

var twoSum = function(nums, target) {
    let answer = [];
    for(let i = 0; i < nums.length; i++){
        for(let j = i+1; j < nums.length; j++){
            if(nums[i] + nums[j] == target){
                answer.push(i);
                answer.push(j);
                break;
            }
        }
    }    
    return answer;
};